Time-Space Trade-Offs for the Longest Common Substring Problem
نویسندگان
چکیده
The Longest Common Substring problem is to compute the longest substring which occurs in at least d ≥ 2 of m strings of total length n. In this paper we ask the question whether this problem allows a deterministic time-space trade-off using O(n) time and O(n1−ε) space for 0 ≤ ε ≤ 1. We give a positive answer in the case of two strings (d = m = 2) and 0 < ε ≤ 1/3. In the general case where 2 ≤ d ≤ m, we show that the problem can be solved in O(n1−ε) space and O(n log n(d log n+ d)) time for any 0 ≤ ε < 1/3.
منابع مشابه
Sublinear Space Algorithms for the Longest Common Substring Problem
Given m documents of total length n, we consider the problem of finding a longest string common to at least d ≥ 2 of the documents. This problem is known as the longest common substring (LCS) problem and has a classic O(n) space and O(n) time solution (Weiner [FOCS’73], Hui [CPM’92]). However, the use of linear space is impractical in many applications. In this paper we show that for any trade-...
متن کاملLongest Common Extensions in Sublinear Space
The longest common extension problem (LCE problem) is to construct a data structure for an input string T of length n that supports LCE(i, j) queries. Such a query returns the length of the longest common prefix of the suffixes starting at positions i and j in T . This classic problem has a well-known solution that uses O(n) space and O(1) query time. In this paper we show that for any trade-of...
متن کاملTime-Space Trade-Offs for Longest Common Extensions
We revisit the longest common extension (LCE) problem, that is, preprocess a string T into a compact data structure that supports fast LCE queries. An LCE query takes a pair (i, j) of indices in T and returns the length of the longest common prefix of the suffixes of T starting at positions i and j. We study the time-space trade-offs for the problem, that is, the space used for the data structu...
متن کاملA note on the longest common substring with $k$-mismatches problem
The recently introduced longest common substring with kmismatches (k-LCF) problem is to find, given two sequences S1 and S2 of length n each, a longest substring A1 of S1 and A2 of S2 such that the Hamming distance between A1 and A2 is at most k. So far, the only subquadratic time result for this problem was known for k = 1 [6]. We first present two output-dependent algorithms solving the k-LCF...
متن کاملar X iv : 1 40 9 . 16 94 v 2 [ cs . D S ] 1 6 M ar 2 01 5 Longest common substrings with k mismatches
The longest common substring with k-mismatches problem is to find, given two strings S1 and S2, a longest substring A1 of S1 and A2 of S2 such that the Hamming distance between A1 and A2 is ≤ k. We introduce a practical O(nm) time and O(1) space solution for this problem, where n and m are the lengths of S1 and S2, respectively. This algorithm can also be used to compute the matching statistics...
متن کامل